1-planar graph

Results: 89



#Item
41On Touching Triangle Graphs Emden R. Gansner1 , Yifan Hu1 , and Stephen G. Kobourov2 1 AT&T Labs - Research, Florham Park, NJ 2

On Touching Triangle Graphs Emden R. Gansner1 , Yifan Hu1 , and Stephen G. Kobourov2 1 AT&T Labs - Research, Florham Park, NJ 2

Add to Reading List

Source URL: www.research.att.com

Language: English - Date: 2011-04-23 00:00:02
42Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown  University, United States

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-03-16 13:08:36
43Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1  Brown University, United States

Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein∗†1 , Claire Mathieu†2 , and Hang Zhou†3 1 Brown University, United States

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-02-19 14:45:50
44Geometric Theory Predicts Bifurcations in Minimal Wiring Cost Trees in Biology Are Flat Yihwa Kim1., Robert Sinclair2., Nol Chindapol3, Jaap A. Kaandorp3, Erik De Schutter1* 1 Computational Neuroscience Unit, Okinawa Ins

Geometric Theory Predicts Bifurcations in Minimal Wiring Cost Trees in Biology Are Flat Yihwa Kim1., Robert Sinclair2., Nol Chindapol3, Jaap A. Kaandorp3, Erik De Schutter1* 1 Computational Neuroscience Unit, Okinawa Ins

Add to Reading List

Source URL: www.tnb.ua.ac.be

Language: English - Date: 2014-02-10 10:38:37
45Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2008-09-19 09:20:43
46EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data Guoliang Li1 1  Beng Chin Ooi2

EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data Guoliang Li1 1 Beng Chin Ooi2

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2012-01-09 09:42:51
47The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel

The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-10-26 12:29:22
48ICS 163 – Spring 2002 – Final Exam  Name: Student ID:  1:

ICS 163 – Spring 2002 – Final Exam Name: Student ID: 1:

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2002-06-12 18:57:00
4916th Canadian Conference on Computational Geometry, 2004  Three-Dimensional 1-Bend Graph Drawings Pat Morin  

16th Canadian Conference on Computational Geometry, 2004 Three-Dimensional 1-Bend Graph Drawings Pat Morin 

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
50Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2013-12-16 02:39:42